#include <bits/stdc++.h>

using namespace std;

class Solution {
public:
    vector<long long> maximumEvenSplit(long long finalSum)
    {
	vector<long long> res;
	if (finalSum & 1) return res;
	int n = sqrt(finalSum);
	for (; n >= 0; --n) if (n * n + n < finalSum) break;
	for (int i = 1; i <= n; ++i) res.push_back(i * 2);
	int rest = finalSum - n * 2;
	res[size(res) - 1] += rest;
	return res;
    }

private:
};

int main()
{
    [[maybe_unused]] Solution solution;
    return 0;
}
